An enhanced chimp optimization algorithm for continuous optimization domains

نویسندگان

چکیده

Abstract Chimp optimization algorithm (ChOA) is a recently proposed metaheuristic. Interestingly, it simulates the social status relationship and hunting behavior of chimps. Due to more flexible complex application fields, researchers have higher requirements for native algorithms. In this paper, an enhanced chimp (EChOA) improve accuracy solutions. First, highly disruptive polynomial mutation used initialize population, which provides foundation global search. Next, Spearman’s rank correlation coefficient chimps with lowest calculated respect leader chimp. To reduce probability falling into local optimum, beetle antennae operator less fit while gaining visual capability. Three strategies enhance exploration exploitation algorithm. verify function performance, EChOA comprehensively analyzed on 12 classical benchmark functions 15 CEC2017 functions. Besides, practicability also highlighted by three engineering design problems training multilayer perceptron. Compared ChOA five state-of-the-art algorithms, statistical results show that has strong competitive capabilities promising prospects.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An artificial beehive algorithm for continuous optimization

This paper presents an artificial beehive algorithm for optimization in continuous search spaces based on a model aimed at individual bee behavior. The algorithm defines a set of behavioral rules for each agent to determine what kind of actions must be carried out. Also, the algorithm proposed includes some adaptations not considered in the biological model to increase the performance in the se...

متن کامل

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems

Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...

متن کامل

An Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering

The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...

متن کامل

Ant colony optimization for continuous domains

In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatorial optimization, can be adapted to continuous optimization without any major conceptual change to its structure. We present the general idea, implementation, and results obtained. We compare the results with those repor...

متن کامل

Implementation of an Ant Colony Optimization Algorithm with Constraint Handling for Continuous and Mixed Variable Domains

The Ant Colony Optimization algorithm was originally conceptualized as an algorithm for solving combinatorial optimization problems. In recent years, it has shown that the ACO metaheuristic can be extended such that it can handle both continuous and mixed variable optimization problems. In this paper we present an constraint-capable extension of Socha and Dorigo’s ACOR and ACOMV .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2021

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-021-00346-5